Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
521	This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2011 proceedings Completion Delay Minimization for Instantly Decodable Networ Add to Reading List Source URL: www.comm.utoronto.ca Language: English - Date: 2011-12-23 16:23:54 NP-complete problems Clique Network coding Shortest path problem Maximal independent set Path decomposition Graph theory Theoretical computer science Mathematics
522	DIHEDRAL COVERS OF THE COMPLETE GRAPH K5 M. GHASEMI Abstract. A regular cover of a connected graph is called dihedral if its transformation group is dihedral. In this paper, the author classifies all dihedral coverings o Add to Reading List Source URL: www.kurims.kyoto-u.ac.jp Language: English - Date: 2014-05-27 07:51:07 Symmetric graph Petersen graph Covering graph Voltage graph Orbifold Graph theory Algebraic graph theory Graph
523	Finding Adam in random growing trees S´ebastien Bubeck ∗ Luc Devroye Add to Reading List Source URL: www.princeton.edu Language: English - Date: 2014-11-13 00:16:29 Tree Graph coloring NP-complete problems Euclidean algorithm Graph theory Mathematics Theoretical computer science
524	Graph Coloring with Quantum Heuristics Alex Fabrikant Tad Hogg EECS Dept., UC Berkeley Add to Reading List Source URL: alex.fabrikant.us Language: English - Date: 2010-01-07 19:33:22 NP-complete problems Search algorithms Graph coloring Routing algorithms Quantum algorithm Heuristic function A* search algorithm Algorithm Travelling salesman problem Theoretical computer science Mathematics Applied mathematics
525	Computational Intelligence, Volume ?, Number ?, 1998 ANALYSIS OF HEURISTIC FOR NUMBER PARTITIONING Ian P. Gent and Toby Walsh fipg,[removed] Department of Computer Science, Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2013-07-29 02:04:54 NP-complete problems Combinatorics Mathematical optimization Partition problem Heuristics Graph theory Heuristic function Bin packing problem Travelling salesman problem Mathematics Theoretical computer science Computational complexity theory
526	Fast Construction of the Vietoris-Rips Complex Afra Zomorodian∗ (To appear in Computer & Graphics) 100 Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2010-03-17 14:16:35 Graph operations Topology NP-complete problems Clique Vietoris–Rips complex Line graph Cograph Triangulation Graph Graph theory Mathematics Algebraic topology
527	SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for Add to Reading List Source URL: siam.org Language: English - Date: 2013-09-19 09:13:08 NP-complete problems Approximation algorithm Submodular set function Shortest path problem Bin packing problem Vertex cover Dominating set Independent set Computational complexity theory Theoretical computer science Graph theory Mathematics
528	Lecture XIV Page 1 “The shortest path between two truths in the real domain passes through the complex domain.” Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-11-21 18:55:28 Operations research Routing algorithms Network flow NP-complete problems Bellman–Ford algorithm Shortest path problem Dynamic programming Flow network Tree Mathematics Theoretical computer science Graph theory
529	Random Graphs and Their Applications Les graphes al´ eatoires et leurs applications (Org: Anthony Bonato (Wilfrid Laurier), Penny Haxell (Waterloo) and/et Nicholas Wormald (Waterloo)) TOM BOHMAN, Carnegie Mellon Univer Add to Reading List Source URL: cms.math.ca Language: English - Date: 2006-07-10 21:18:22 Graph coloring NP-complete problems Random graph Graph Connectivity Cubic graph Dense graph Matroid theory Randomized algorithm Graph theory Mathematics Theoretical computer science
530	Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study Jeremy Franky and Ian P. Gentz and Toby Walshz August 15, 1997 analysis of algorithms, computational complexity, phase tra Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2013-07-29 02:03:45 NP-complete problems Hamiltonian path Shortest path problem NP-complete Asymptotic analysis Graph coloring Graph Computational complexity theory Random graph Graph theory Theoretical computer science Mathematics

UPDATE